package 第11周_线段树_Trie和并查集.线段树;

public class Main {
    public static void main(String[] args) {
        Integer[] nums = {-1, 0, 3, -5, 2, -1};
        SegmentTree<Integer> segTree = new SegmentTree<>(nums, (a, b) -> a + b);
//        System.out.println(segTree);

        System.out.println(segTree.query(0, 2));


    }
}
